Relational measures and integration in preference modeling
نویسندگان
چکیده
منابع مشابه
Relational measures and integration in preference modeling
Based on a set of criteria and a measuring lattice, we introduce relational measures as generalizations of fuzzy measures. The latter have recently made their way from the interval [0, 1] ⊆ IR to the ordinal or even to the qualitative level. We proceed further and introduce relational measures and relational integration. First ideas of this kind, but for the real-valued linear orderings stem fr...
متن کاملIntegration of probabilistic relational modeling and reasoning into Protégé
In probabilistic relational models (PRMs) [2, 3] slots of classes and instances are represented by probability distributions. During reasoning using these models , values of unknown slots are calculated via Bayesian inference [1]. Advantages of PRMs over pure logic modeling techniques are: • relational domains with inherent uncertainty on parameters and structure can be represented, • parameter...
متن کاملRelational Preference Rules for Control
Much like relational probabilistic models, the need for relational preference models arises naturally in real-world applications where the set of object classes is fixed, but object instances vary from one application to another as well as within the run-time of a single application. To address this problem, we suggest a rule-based preference specification language. This language extends regula...
متن کاملOptimization of Relational Preference Queries
The design and implementation of advanced personalized database applications requires a preference-driven approach. Representing preferences as strict partial orders is a good choice in most practical cases. Therefore the efficient integration of preference querying into standard database technology is an important issue. We present a novel approach to relational preference query optimization b...
متن کاملPreference-Driven Keyword Search in Relational Databases
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches may return an overwhelming number of results. In this paper, we propose personalizing keyword database search by allowing users to express preferences. User preferences depend on context. Given the context of a keywor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2008
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2007.10.001